Bounds and Definability in Polynomial Rings
نویسنده
چکیده
We study questions around the existence of bounds and the dependence on parameters for linear-algebraic problems in polynomial rings over rings of an arithmetic flavor. In particular, we show that the module of syzygies of polynomials f1, . . . , fn ∈ R[X1, . . . , XN ] with coefficients in a Prüfer domain R can be generated by elements whose degrees are bounded by a number only depending on N , n and the degree of the fj . This implies that if R is a Bézout domain, then the generators can be parametrized in terms of the coefficients of f1, . . . , fn using the ring operations and a certain division function, uniformly in R.
منابع مشابه
On constant products of elements in skew polynomial rings
Let $R$ be a reversible ring which is $alpha$-compatible for an endomorphism $alpha$ of $R$ and $f(X)=a_0+a_1X+cdots+a_nX^n$ be a nonzero skew polynomial in $R[X;alpha]$. It is proved that if there exists a nonzero skew polynomial $g(X)=b_0+b_1X+cdots+b_mX^m$ in $R[X;alpha]$ such that $g(X)f(X)=c$ is a constant in $R$, then $b_0a_0=c$ and there exist nonzero elements $a$ and $r$ in $R$ such tha...
متن کاملNilpotent Elements in Skew Polynomial Rings
Letbe a ring with an endomorphism and an -derivationAntoine studied the structure of the set of nilpotent elements in Armendariz rings and introduced nil-Armendariz rings. In this paper we introduce and investigate the notion of nil--compatible rings. The class of nil--compatible rings are extended through various ring extensions and many classes of nil--compatible rings are constructed. We al...
متن کاملOn annihilator ideals in skew polynomial rings
This article examines annihilators in the skew polynomial ring $R[x;alpha,delta]$. A ring is strongly right $AB$ if everynon-zero right annihilator is bounded. In this paper, we introduce and investigate a particular class of McCoy rings which satisfy Property ($A$) and the conditions asked by P.P. Nielsen. We assume that $R$ is an ($alpha$,$delta$)-compatible ring, and prove that, if $R$ is ni...
متن کاملDefinability of linear equation systems over groups and rings
Motivated by the quest for a logic for PTIME and recent insights that the descriptive complexity of problems from linear algebra is a crucial aspect of this problem, we study the solvability of linear equation systems over finite groups and rings from the viewpoint of logical (inter-)definability. All problems that we consider are decidable in polynomial time, but not expressible in fixedpoint ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003